﻿
преобразование Адамара.

English-Russian cryptological dictionary . 2014.

### Смотреть что такое "Hadamard transform" в других словарях:

• Hadamard transform — The Hadamard transform (also known as the Walsh Hadamard transform, Hadamard Rademacher Walsh transform, Walsh transform, or Walsh Fourier transform) is an example of a generalized class of Fourier transforms. It is named for the French… …   Wikipedia

• Fast Walsh–Hadamard transform — In computational mathematics, the Hadamard ordered fast Walsh–Hadamard transform (FWHTh) is an efficient algorithm to compute the Walsh–Hadamard transform (WHT). A naive implementation of the WHT would have a computational complexity of O(N^2).… …   Wikipedia

• Pseudo-Hadamard transform — The pseudo Hadamard transform is a reversible transformation of a bit string that provides cryptographic diffusion. See Hadamard transform.The bit string must be of even length, so it can be split into two bit strings a and b of equal lengths,… …   Wikipedia

• Hadamard (disambiguation) — Hadamard may refer to* Jacques Hadamard * Hadamard gate * Hadamard matrix * Hadamard s inequality * Hermite–Hadamard inequality * Walsh–Hadamard transform * Fast Walsh–Hadamard transform …   Wikipedia

• Hadamard variance — The Hadamard variance (HVAR) is a measure of stability of clocks and oscillators. It uses 3 sample variance, not unlike the Allan variance, which uses 2 sample variance. But unlike the Allan variance, the Hadamard variance is able to converge a… …   Wikipedia

• Hadamard code — The Hadamard code, named after Jacques Hadamard, is a system used for signal error detection and correction. It is one of the family of [2 n , n + 1, 2 n − 1] codes. Especially for large n it has a poor rate but it is capable of correcting many… …   Wikipedia

• Jacques Hadamard — Infobox Scientist name = Jacques Hadamard |300px image width = 300px caption = Jacques Salomon Hadamard birth date = birth date|1865|12|8|mf=y birth place = Versailles, France death date = death date and age|1963|10|17|1865|12|8|mf=y death place …   Wikipedia

• Arithmetic complexity of the discrete Fourier transform — See Fast Fourier transform#Bounds on complexity and operation counts for a general summary of this issue.Bounds on the multiplicative complexity of FFTIn his PhD thesis in 1987 [1] , Michael Heidman focus on the arithmetic theory of complexity… …   Wikipedia

• Transformation de Hadamard-Walsh — Transformée de Hadamard La transformée d´Hadamard (aussi connue sous le nom de « transformée de Walsh Hadamard ») est un exemple d une classe généralisée d une transformée de Fourier. Elle est nommée d après le mathématicien français… …   Wikipédia en Français

• Transformee de Hadamard — Transformée de Hadamard La transformée d´Hadamard (aussi connue sous le nom de « transformée de Walsh Hadamard ») est un exemple d une classe généralisée d une transformée de Fourier. Elle est nommée d après le mathématicien français… …   Wikipédia en Français

• Quantum Fourier transform — The quantum Fourier transform is the discrete Fourier transform with a particular decomposition into a product of simpler unitary matrices. Using this decomposition, the discrete Fourier transform can be implemented as a quantum circuit… …   Wikipedia

### Поделиться ссылкой на выделенное

##### Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»

We are using cookies for the best presentation of our site. Continuing to use this site, you agree with this.